摘要 :
In this article we uncover the challenges relating to service-oriented data aggregation and introduce a system called Ontology Mediated Web Service Aggregation Hub to enable dynamic composition of groups of data-oriented web servi...
展开
In this article we uncover the challenges relating to service-oriented data aggregation and introduce a system called Ontology Mediated Web Service Aggregation Hub to enable dynamic composition of groups of data-oriented web services. The proposed solution addresses the problems faced by service-oriented data aggregation. We specifically focus on the issues of semantic heterogeneity and message mediation and develop two Ontologies for achieving seamless message transformation and aggregation among heterogeneous services. Important contributions of this work include a generic Ontology-based approach for classifying services based on service capabilities and a generic Ontology-based approach for round-trip mapping and translation between XML and Ontology formats.
收起
摘要 :
Workflow design, mashup configuration, and composite service formation are examples where the capabilities of multiple simple services combined achieve a complex functionality. In this paper, we address the problem of limiting the...
展开
Workflow design, mashup configuration, and composite service formation are examples where the capabilities of multiple simple services combined achieve a complex functionality. In this paper, we address the problem of limiting the number of required services that fulfill the required capabilities while exploiting the functional specialization of individual services. Our approach strikes a balance between finding one service that matches all required capabilities and having one service for each required capability. Specifically, we introduce a weighted fuzzy clustering algorithm that detects implicit service capability groups. The clustering algorithm considers capability importance and service fitness to support those capabilities. Evaluation based on a real-world data set successfully demonstrates the effectiveness of and applicability for service aggregation.
收起
摘要 :
To support m-commerce applications, a service discovery mechanism where services can announce their presence and mobile users can locate these services is needed. Service discovery in dynamic mobile environments poses many challen...
展开
To support m-commerce applications, a service discovery mechanism where services can announce their presence and mobile users can locate these services is needed. Service discovery in dynamic mobile environments poses many challenges such as service providers may create and delete services or servers anytime; mobile services may be deployed in various forms, etc. In this paper, we propose a design for a Service Locating Service (SLS), which addresses some of these issues to provide a flexible service discovery mechanism for m-commerce applications. In our architecture, we adopt a dynamic tree structure for organizing SLS servers to meet the dynamic requirements of services and servers; we introduce service aggregation for fast locating; and we also propose multiple service matching mechanisms, which contain an attribute matching engine and a semantic matching engine for different service interfaces. We describe our concepts, architecture and implementation, and present a performance study for our prototype.
收起
摘要 :
In a globally connected business environment, a variety of stakeholders, aside from the owner of smart products, aim to operate and extract information from the smart product through smart services. The smart services are generate...
展开
In a globally connected business environment, a variety of stakeholders, aside from the owner of smart products, aim to operate and extract information from the smart product through smart services. The smart services are generated through aggregation of data to operations and information and recombination of these entities. Smart services offer a great potential to enrich the functionalities of smart products. In this paper we propose a novel design methodology to incorporate not only the resources of manufacturers of smart products but also a multitude of interested stakeholder using a robotic vacuum cleaner.
收起
摘要 :
With the adoption of a service-oriented paradigm on the Web, many software services are likely to fulfil similar functional needs for end-users. We propose to aggregate functionally equivalent software services within one single v...
展开
With the adoption of a service-oriented paradigm on the Web, many software services are likely to fulfil similar functional needs for end-users. We propose to aggregate functionally equivalent software services within one single virtual service, that is, to associate a functionality, a graphical user interface (GUI), and a set of selection rules. When an end user invokes such a virtual service through its GUI to answer his/her functional need, the software service that best responds to the end-user's selection policy is selected and executed and the result is then rendered to the end-user through the GUI of the virtual service. A key innovation in this paper is the flexibility of our proposed service selection policy. First, each selection policy can refer to heterogeneous parameters (e.g., service price, end-user location, and QoS). Second, additional parameters can be added to an existing or new policy with little investment. Third, the end users themselves define a selection policy to apply during the selection process, thanks to the GUI element added as part of the virtual service design. This approach was validated though the design, implementation, and testing of an end-to-end architecture, including the implementation of several virtual services and utilizing several software services available today on the Web.
收起
摘要 :
Our long-term objective is to develop a general methodology for deploying (Web) service aggregation and adaptation middleware, capable of suitably overcoming syntactic and behavioral mismatches in view of application integration w...
展开
Our long-term objective is to develop a general methodology for deploying (Web) service aggregation and adaptation middleware, capable of suitably overcoming syntactic and behavioral mismatches in view of application integration within and across organizational boundaries.
This article focuses on describing the core aggregation process, which generates the workflow of a composite service from a set of service workflows to be aggregated and a data-flow mapping linking service parameters.
收起
摘要 :
In recent years, healthcare wireless sensor networks (HWSNs) have received extensive attention. Due to the direct participation of patients’ personal health data, privacy issues, and security are very sensitive in HWSNs. How to a...
展开
In recent years, healthcare wireless sensor networks (HWSNs) have received extensive attention. Due to the direct participation of patients’ personal health data, privacy issues, and security are very sensitive in HWSNs. How to aggregate the sensitive patient information securely and efficiently is still a challenging task to the HWSNs communication scenario. In this article, a lightweight data aggregation protocol with privacy-preserving is proposed to achieve enhancing security in HWSNs. With the proposed protocol, patients’ personal health data collected by the data collect client can be aggregated by data aggregator and efficiently obtained by the medical service provider in a privacy-preserving manner. In particular, we first propose an efficient certificateless aggregate signcryption scheme, and then, design a data aggregation protocol for patient condition monitoring with information confidentiality, integrity, mutual authenticity, and public verifiability. Performance comparisons show that our newly proposed protocol significantly reduces computing overhead compared to the latest protocols in the field.
收起
摘要 :
Many organizations around the world have started to adopt Web services as well as server farms and clouds hosted by large enterprise and data centers for various applications. Web Services offer several advantages over other commu...
展开
Many organizations around the world have started to adopt Web services as well as server farms and clouds hosted by large enterprise and data centers for various applications. Web Services offer several advantages over other communication technologies. However, they have high latency and often suffer from congestion and bottlenecks due to the massive load generated by web service requests from large numbers of end users. SOAP (Simple Object Access Protocol) is the basic XML-based communication protocol of Web services. XML is a verbose encoding language in comparison with other technologies such CORBA and RMI. In this paper, two new redundancy-aware SOAP Web message aggregation models - Two-bit and One-bit XML status tree - are proposed to enable the Web servers to aggregate SOAP responses and send them back as one compact aggregated message in order to reduce the required bandwidth, latency, and improve the overall performance of Web services. XML message compressibility, the Jaccard based clustering technique, and the vector space model are three similarity measurements that are proposed to cluster SOAP messages as groups based on their similarity degree. The clustering based similarity measurements enable the aggregation techniques to potentially reduce the required network traffic by minimizing the overall size of the messages. The experiments show significant performance for both aggregation techniques achieving compression ratios as high as 25 for aggregated SOAP messages.
收起
摘要 :
With the growing complexity of customer requirements and the increasing scale of manufacturing services, how to select and combine the single services to meet the complex demand of the customer has become a growing concern. This p...
展开
With the growing complexity of customer requirements and the increasing scale of manufacturing services, how to select and combine the single services to meet the complex demand of the customer has become a growing concern. This paper presents a new manufacturing service composition method to solve the multi-objective optimization problem based on quality of service (QoS). The proposed model not only presents different methods for calculating the transportation time and transportation cost under various structures but also solves the three-dimensional composition optimization problem, including service aggregation, service selection, and service scheduling simultaneously. Further, an improved Flower Pollination Algorithm (IFPA) is proposed to solve the three-dimensional composition optimization problem using a matrix-based representation scheme. The mutation operator and crossover operator of the Differential Evolution (DE) algorithm are also used to extend the basic Flower Pollination Algorithm (FPA) to improve its performance. Compared to Genetic Algorithm, DE, and basic FPA, the experimental results confirm that the proposed method demonstrates superior performance than other meta heuristic algorithms and can obtain better manufacturing service composition solutions.
收起
摘要 :
Typically, users' service requests, which are similar with varying preferences on non-functional attributes, may result in ranked lists of services that partially meet their needs due to conflicting nonfunctional attributes. The r...
展开
Typically, users' service requests, which are similar with varying preferences on non-functional attributes, may result in ranked lists of services that partially meet their needs due to conflicting nonfunctional attributes. The resultant multiple ranked lists of services that partially satisfies the user's request makes it challenging for the user to choose an optimal service, based on his/her preference. This work proposes a method that aggregates multiple ranked lists of services into a single aggregated ranked list, where top ranked services are selected for the user. Two algorithms are proposed; 1) Rank Aggregation for Complete Lists (RACoL), that aggregates complete ranked lists and 2) Rank Aggregation for Incomplete Lists (RAIL) to aggregate incomplete ranked lists. Examples using real-world airline services to evaluate both algorithms show that the results from both proposed algorithms closely represent the sets of ranked lists better than using alternative approaches. Experiments were also carried out to validate their performance.
收起
原文获取